Group Class Residual ℓ1-Minimization on Random Projection Sparse Representation Classifier for Face Recognition
نویسندگان
چکیده
Sparse Representation-based Classification (SRC) has been seen to be a reliable Face Recognition technique. The ℓ1 Bayesian based on the Lasso algorithm proven most effective in class identification and computation complexity. In this paper, we revisit classification then recommend group-based classification. proposed modified algorithm, which is called as Group Class Residual (GCR-SRC), extends coherency of test sample whole training samples identified rather than only nearest one samples. Our method between To reduce dimension samples, choose random projection for feature extraction. This selected computational cost without increasing algorithm’s From simulation result, reduction factor (ρ) 64 can achieve maximum recognition rate about 10% higher SRC original using downscaling method. method’s feasibility effectiveness are tested four popular face databases, namely AT&T, Yale B, Georgia Tech, AR Dataset. GCR-SRC GCR-RP-SRC achieved up 4% more accurate with class-specific residuals. experiment results show that technology group-class-based not reduces data but also increases accuracy, indicating it feasible recognition.
منابع مشابه
Face Recognition in Thermal Images based on Sparse Classifier
Despite recent advances in face recognition systems, they suffer from serious problems because of the extensive types of changes in human face (changes like light, glasses, head tilt, different emotional modes). Each one of these factors can significantly reduce the face recognition accuracy. Several methods have been proposed by researchers to overcome these problems. Nonetheless, in recent ye...
متن کاملSparse Representation for Face Recognition
Sparse representation has attracted a great deal of attention in the past decade. Famous transforms such as discrete Fourier transform, wavelet transform and singular value decomposition are used to sparsely represent the signals. The aim of these transforms is to reveal certain structures of a signal and representation of these structures in a compact form. Therefore, sparse representation pro...
متن کاملFace Recognition Using Sparse Representation
Many classic and contemporary face recognition algorithms work well on public data sets, but degrade sharply when they are used in a real recognition system. This is mostly due to the difficulty of simultaneously handling variations in illumination, image misalignment, and occlusion in the test image. We consider a scenario where the training images are well controlled and test images are only ...
متن کاملSparse Representation for Video-Based Face Recognition
With the ever-increasing security threats, the problem of invulnerable authentication systems is becoming more acute. Traditional means of securing a facility essentially depend on strategies corresponding to “what you have” or “what you know”, for example smart cards, keys and passwords. These systems however can easily be fooled. Passwords for example, are difficult to remember and therefore ...
متن کاملCompetitive Sparse Representation Classification for Face Recognition
A method, named competitive sparse representation classification (CSRC), is proposed for face recognition in this paper. CSRC introduces a lowest competitive deletion mechanism which removes the lowest competitive sample based on the competitive ability of training samples for representing a probe in multiple rounds collaborative linear representation. In other words, in each round of competing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11172723